Generalized Nash equilibrium problems and Newton methods
نویسندگان
چکیده
The generalized Nash equilibrium problem, where the feasible sets of the players may depend on the other players’ strategies, is emerging as an important modeling tool. However, its use is limited by its great analytical complexity. We consider several Newton methods, analyze their features and compare their range of applicability. We illustrate in detail the results obtained by applying them to a model for internet switching.
منابع مشابه
On error bounds and Newton-type methods for generalized Nash equilibrium problems
Error bounds (estimates for the distance to the solution set of a given problem) are key to analyzing convergence rates of computational methods for solving the problem in question, or sometimes even to justifying convergence itself. That said, for the generalized Nash equilibrium problems (GNEP), the theory of error bounds had not been developed in depth comparable to the fields of optimizatio...
متن کاملSc Optimization Reformulations of the Generalized Nash Equilibrium Problem
The generalized Nash equilibrium problem is a Nash game which, in contrast to the standard Nash equilibrium problem, allows the strategy sets of each player to depend on the decision variables of all other players. It was recently shown by the authors that this generalized Nash equilibrium problem can be reformulated as both an unconstrained and a constrained optimization problem with continuou...
متن کاملAn Iterative Scheme for Generalized Equilibrium, Variational Inequality and Fixed Point Problems Based on the Extragradient Method
The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...
متن کاملSC 1 optimization reformulations of the generalized Nash equilibrium problem
The generalized Nash equilibrium problem is a Nash game which, in contrast to the standard Nash equilibrium problem, allows the strategy sets of each player to depend on the decision variables of all other players. It was recently shown by the authors that this generalized Nash equilibrium problem can be reformulated as both an unconstrained and a constrained optimization problem with continuou...
متن کاملA Nonsmooth Newton Method with Path Search and Its Use in Solving C1, 1 Programs and Semi-Infinite Problems
In [S. Bütikofer, Math. Methods Oper. Res., 68 (2008), pp. 235–256] a nonsmooth Newton method globalized with the aid of a path search was developed in an abstract framework. We refine the convergence analysis given there and adapt this algorithm to certain finite dimensional optimization problems with C1,1 data. Such problems arise, for example, in semi-infinite programming under a reduction a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 117 شماره
صفحات -
تاریخ انتشار 2009